A note on matroids and block designs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on block-transitive point-imprimitive designs

We study block-transitive point-imprimitive designs. Cameron and Praeger showed that in such designs t = 2 or 3. In 2000, Mann and Tuan showed that if t = 3 then v ≤ (k2) + 1. In this paper, we show a finiteness theorem for block-transitive point-imprimitive 3-designs for which this bound is met. We prove that for a given natural number n, there are only finitely many numbers k of the form npα ...

متن کامل

A note on nongraphic matroids

Tutte found an excluded minor characterization of graphic matroids with five excluded minors. A variation on Tutte's result is presented here. Let (e, f, g} be a circuit of a 3-connected nongraphic matroid M. Then M has a minor using e, A g isomorphic to either the 4-point line, the Fano matroid, or the bond matroid of K 3,3' 0 1984 Academic Press, Inc.

متن کامل

A Note on Mixed Graphs and Matroids

A mixed graph is a graph with some directed edges and some undirected edges. We introduce the notion of mixed matroids as a generalization of mixed graphs. A mixed matroid can be viewed as an oriented matroid in which the signs over a fixed subset of the ground set have been forgotten. We extend to mixed matroids standard definitions from oriented matroids, establish basic properties, and study...

متن کامل

Note on GMW Designs

Let N and n be integers such that n|N and 2 < n < N . Let q be a prime power. The difference sets introduced by Gordon, Mills and Welch in [1] produce symmetric designs with the same parameters v = (q N −1)/(q−1), k = (q N−1−1)/(q−1), λ = (q N−2−1)/(q−1) as the point-hyperplane design of PG(N − 1, q). The purpose of this note is to prove that inequivalent difference sets of this sort produce no...

متن کامل

A Note on Maxflow-Mincut and Homomorphic Equivalence in Matroids

Graph homomorphisms are used to study good characterizations for coloring problems (Trans. Amer. Math. Soc. 384 (1996), 1281–1297; Discrete Math. 22 (1978), 287–300). Particularly, the following concept arises in this context: A pair of graphs (A, B) is called a homomorphism duality if for any graph G either there exists a homomorphism σ : A→ G or there exists a homomorphism τ : G → B but not b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Australian Mathematical Society

سال: 1975

ISSN: 1446-7887,1446-8107

DOI: 10.1017/s1446788700023922